Sparse inverse solution methods for signal and image processing applications
نویسنده
چکیده
This paper addresses image and signal processing problems where the result most consistent with prior knowledge is the minimum order, or “maximally sparse” solution. These problems arise in such diverse areas as astronomical star image deblurring, neuromagnetic image reconstruction, seismic deconvolution, and thinned array beamformer design. An optimization theoretic formulation for sparse solutions is presented, and its relationship to the MUSIC algorithm is discussed. Two algorithms for sparse inverse problems are introduced, and examples of their application to beamforming array design and star image deblurring are presented.
منابع مشابه
Deblocking Joint Photographic Experts Group Compressed Images via Self-learning Sparse Representation
JPEG is one of the most widely used image compression method, but it causes annoying blocking artifacts at low bit-rates. Sparse representation is an efficient technique which can solve many inverse problems in image processing applications such as denoising and deblocking. In this paper, a post-processing method is proposed for reducing JPEG blocking effects via sparse representation. In this ...
متن کاملFast Reconstruction of SAR Images with Phase Error Using Sparse Representation
In the past years, a number of algorithms have been introduced for synthesis aperture radar (SAR) imaging. However, they all suffer from the same problem: The data size to process is considerably large. In recent years, compressive sensing and sparse representation of the signal in SAR has gained a significant research interest. This method offers the advantage of reducing the sampling rate, bu...
متن کاملImage Classification via Sparse Representation and Subspace Alignment
Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...
متن کاملSparse Signal Representation: Image Compression using Sparse Bayesian Learning
with Φ ∈ RN×M , M ≥ N , and some noise . The challenge is to determine the sparsest representation of reconstruction coefficients w = [w1, . . . , wM ] . Finding a sparse representation of a signal in an overcomplete dictionary is equivalent to solving a regularized linear inverse. For a given dictionary Φ, finding the maximally sparse w is an NP-hard problem [1]. A great deal of recent researc...
متن کاملFrom Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
A full-rank matrix A ∈ IRn×m with n < m generates an underdetermined system of linear equations Ax = b having infinitely many solutions. Suppose we seek the sparsest solution, i.e., the one with the fewest nonzero entries: can it ever be unique? If so, when? As optimization of sparsity is combinatorial in nature, are there efficient methods for finding the sparsest solution? These questions hav...
متن کامل